Performance Analysis of Priority Queueing Systems in Discrete Time
نویسندگان
چکیده
The integration of different types of traffic in packet-based networks spawns the need for traffic differentiation. In this tutorial paper, we present some analytical techniques to tackle discrete-time queueing systems with priority scheduling. We investigate both preemptive (resume and repeat) and non-preemptive priority scheduling disciplines. Two classes of traffic are considered, high-priority and low-priority traffic, which both generate variable-length packets. A probability generating functions approach leads to performance measures such as moments of system contents and packet delays of both classes.
منابع مشابه
Discrete Time Analysis of Multi-Server Queueing System with Multiple Working Vacations and Reneging of Customers
This paper analyzes a discrete-time $Geo/Geo/c$ queueing system with multiple working vacations and reneging in which customers arrive according to a geometric process. As soon as the system gets empty, the servers go to a working vacations all together. The service times during regular busy period, working vacation period and vacation times are assumed to be geometrically distributed. Customer...
متن کاملMulti-Objective Lead Time Control in Multistage Assembly Systems (TECHNICAL NOTE)
In this paper we develop a multi-objective model to optimally control the lead time of a multistage assembly system. The multistage assembly system is modeled as an open queueing network, whose service stations represent manufacturing or assembly operations. The arrival processes of the individual parts of the product, which should be assembled to each other in assembly stations, are assumed to...
متن کاملDelay Analysis of a HOL Priority Queue
Priority scheduling for packets is a hot topic, as interactive (voice,video) services are being integrated in existing data networks. In this paper, we consider a discrete-time queueing system with a non-preemptive (or Head-Of-the-Line) priority scheduling discipline and a general number of priority classes. Packets of variable length arrive in the queueing system. We derive expressions for the...
متن کاملA matrix-analytic solution for the DBMAP/PH/1 priority queue
Abstract Priority queueing models have been commonly used in telecommunication systems. The development of analytically tractable models to determine their performance is vitally important. The discrete time batch Markovian arrival process (DBMAP ) has been widely used to model the source behavior of data traffic, while phase-type (PH) distribution has been extensively applied to model the serv...
متن کاملPartially Shared Buffers with Full or Mixed Priority
This paper studies a finite-sized discrete-time two-class priority queue. Packets of both classes arrive according to a two-class discrete batch Markovian arrival process (2-DBMAP), taking into account the correlated nature of arrivals in heterogeneous telecommunication networks. The model incorporates time and space priority to provide different types of service to each class. One of both clas...
متن کامل